#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
const int MAXN=20010;
int A[MAXN],B[MAXN];
int main()
{
    int n,m;
    int i,j;
    while(scanf("%d%d",&n,&m)==2)
    {
        if(n==0&&m==0)break;
        for(i=0;i<n;i++)scanf("%d",&A[i]);
        for(i=0;i<m;i++)scanf("%d",&B[i]);
        sort(A,A+n);
        sort(B,B+m);
        i=0;
        j=0;
        int ans=0;
        for(i=0;i<n;i++)
        {
            if(j>=m)break;
            while(j<m&&A[i]>B[j])j++;
            if(j>=m)break;
            ans+=B[j];
            j++;
        }
        if(i<n)printf("Loowater is doomed!\n");
        else printf("%d\n",ans);
    }
    return 0;
}